Structure-based graph distance measures of high degree of precision
نویسندگان
چکیده
Department of Computing and Information Technology, Fudan University, Shanghai, China 2 Theoretical Systems Biology Lab , School of Life Science, Fudan University, Shanghai, China Human Genetics Center, University of Texas Health Science Center at Houston, Houston, TX 77225, USA Abstract In recent years, evaluating graph distance has become more and more important in a variety of real applications and many graph distance measures have been proposed. Among all of those measures, structure-based graph distance has become the research focus due to its independence of the definition of cost function. However, the existing structure-based graph distance measures have low degree of precision because only node and edge information of graphs are employed in these graphs metrics. To improve the precision of graph distance measure, we define a substructure abundance vector (SAV) to capture more substructure information of a graph. Furthermore, based on the SAV, we propose unified graph distance measures which are generalization of the existing structurebased graph distance measures. In general, the unified graph distance measures can evaluate graph distance in much finer grain. We also show that unified graph distance measures based on occurrence mapping and some of their variants are metrics. Finally, we apply the unified graph distance metric and its variants to the population evolution analysis and construct distance graphs of marker networks in three populations, which reflect the single nucleotide polymorphism (SNP) linkage disequilibrium (LD) differences among these populations.
منابع مشابه
Graph Hybrid Summarization
One solution to process and analysis of massive graphs is summarization. Generating a high quality summary is the main challenge of graph summarization. In the aims of generating a summary with a better quality for a given attributed graph, both structural and attribute similarities must be considered. There are two measures named density and entropy to evaluate the quality of structural and at...
متن کاملProduct version of reciprocal degree distance of composite graphs
A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملOn the Variance-Type Graph Irregularity Measures
Bell's degree-variance Var$!{}_{B}$ for a graph $G$, with the degree sequence ($d_1,d_2,cdots,d_n$) and size $m$, is defined as$Var!_{B} (G)=frac{1}{n} sum _{i=1}^{n}left[d_{i} -frac{2m}{n}right]^{2}$.In this paper, a new version of the irregularity measures of variance-type, denoted by $Var_q$, is introduced and discussed. Based on a comparative study, it is demonstrated that the n...
متن کاملSeveral new results based on the study of distance measures of intuitionistic fuzzy sets
It is doubtless that intuitionistic fuzzy set (IFS) theory plays an increasingly important role in solving the problems under uncertain situation. As one of the most critical members in the theory, distance measure is widely used in many aspects. Nevertheless, it is a pity that part of the existing distance measures has some drawbacks in practical significance and accuracy. To make up for their...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition
دوره 41 شماره
صفحات -
تاریخ انتشار 2008